Computational Models of Anaphora

نویسندگان

چکیده

Interpreting anaphoric references is a fundamental aspect of our language competence that has long attracted the attention computational linguists. The appearance ever-larger anaphorically annotated data sets covering more and phenomena in ever-greater detail spurred development increasingly sophisticated models; as result, most recent state-of-the-art neural models are able to achieve impressive performance by leveraging linguistic, lexical, discourse, encyclopedic information. This article provides thorough survey anaphora resolution (coreference) throughout this development, reviewing available both preneural history field and—in detail—current models, including research on less-studied aspects interpretation such bridging reference discourse deixis interpretation.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computational Approach to Anaphora Resolutionin

This paper presents an algorithm for identifying noun-phrase antecedents of pronouns and adjectival anaphors in Spanish dialogues. We believe that anaphora resolution requires numerous sources of information in order to nd the correct antecedent of the anaphor. These sources can be of diierent kinds, e.g., linguistic information, discourse/dialogue structure information, or topic information. F...

متن کامل

A Computational Approach to Pronominal Anaphora, One- Anaphora and Surface Count Anaphora

This paper is the continuation of Ferrández [5][4] in which we have developed a computational system in Prolog (Slot Unification Parser or SUP) that includes a new grammatical formalism (Slot Unification Grammar or SUG). In this work, we are going to deal with several kinds of anaphora both in restricted and unrestricted texts: pronominal anaphora, surface count anaphora and one-anaphora. We on...

متن کامل

Anaphora resolution and minimal models

Some anaphora resolution algorithms are based on model builders, and use the fact that they generate minimal models: only those elements that are necessary are postulated to exist in the model. In this way, such systems have the desirable property that if anaphora can be resolved to a linguistically available antecedent, this resolution applies, and only if there is no suitable antecedent, a de...

متن کامل

Discourse anaphora: Four theoretical models

One of the central issues in the study of discourse anaphora is concerned with the problem of anaphoric distribution in discourse, namely how to account for the choice of a particular referential/anaphoric form at a particular point in discourse. Needless to say, anaphoric distribution in discourse is a very complex phenomenon, involving, among other things, structural, cognitive and pragmatic ...

متن کامل

Computational Approach to Anaphora Resolution in Spanish Dialogues

This paper presents an algorithm for identifying noun-phrase antecedents of pronouns and adjectival anaphors in Spanish dialogues. We believe that anaphora resolution requires numerous sources of information in order to nd the correct antecedent of the anaphor. These sources can be of diierent kinds, e.g., linguistic information, discourse/dialogue structure information, or topic information. F...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Annual review of linguistics

سال: 2023

ISSN: ['2333-9683', '2333-9691']

DOI: https://doi.org/10.1146/annurev-linguistics-031120-111653